package cuppics;

import org.junit.Test;

public class Prj11 {

	/**
	 * In the 20×20 grid below, four numbers along a diagonal line have been
	 * marked in red.
	 * 
	 * 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40
	 * 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29
	 * 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56
	 * 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28
	 * 66 33 13 80 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
	 * 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68
	 * 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26
	 * 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14
	 * 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14
	 * 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
	 * 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68
	 * 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16
	 * 07 97 57 32 16 26 26 79 33 27 98 66 88 36 68 87 57 62 20 72 03 46 33 67
	 * 46 55 12 32 63 93 53 69 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32
	 * 40 62 76 36 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
	 * 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 01 70 54 71
	 * 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48 The product of these
	 * numbers is 26 × 63 × 78 × 14 = 1788696.
	 * 
	 * What is the greatest product of four adjacent numbers in the same
	 * direction (up, down, left, right, or diagonally) in the 20×20 grid?
	 */
	@Test
	public void test() {

		int val = Integer.parseInt("02");
		System.out.println(val);
	}

	public static final String VAL_STR =
			  " 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08"
			+ " 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00"
			+ " 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65"
			+ " 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91"
			+ " 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80"
			+ " 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50"
			+ " 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70"
			+ " 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21"
			+ " 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72"
			+ " 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95"
			+ " 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92"
			+ " 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57"
			+ " 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58"
			+ " 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40"
			+ " 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66"
			+ " 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69"
			+ " 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36"
			+ " 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16"
			+ " 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54"
			+ " 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48";

	public int[][] parser(String valStr, int gridSize) {

		int[][] ret = new int[gridSize][gridSize];

		String[] splitStr = valStr.split(" ");
		for (int i = 0; i < splitStr.length; i++) {

			for (int j = 0; j < gridSize; j++) {
				for (int k = 0; k < gridSize; k++) {
					ret[j][k] = Integer.parseInt(splitStr[i]);
				}
			}
		}
		return ret;

	}

	public int calculateMax(int[][] val, int gridSize) {

		int max = 0;

		Region rg = null;

		for (int i = 0; i < gridSize; i++) {
			for (int j = 0; j < gridSize; j++) {

				if (isBound(i, j, gridSize)) {
					continue;
				}
				if (isSecondBound(i, j, gridSize)) {

					rg = calculateSecondMax(i, j, gridSize, val);

				} else {

					rg = calculateInnerMax(i, j, gridSize, val);
				}
				if (rg.max > max) {
					max = rg.max;
				}
			}
		}

		System.out.println("max =" + max);

		return 0;
	}

	private Region calculateInnerMax(int i, int j, int gridSize, int[][] val) {

		Region rg = new Region();
		rg.up = val[i - 1][j];
		rg.left = val[i][j - 1];
		rg.right = val[i][j + 1];
		rg.down = val[i + 1][j];
		rg.center = val[i][j];
		rg.max = rg.up * rg.left * rg.down * rg.right;
		
		rg.v45E = val[i - 2][j + 2];
		rg.v135E = val[i - 2][j - 2];
		rg.v225E = val[i + 2][j - 2];
		rg.v270E = val[i + 2][j + 2];
		
		rg.v45 = val[i - 1][j + 1];
		rg.v135 = val[i - 1][j - 1];
		rg.v225 = val[i + 1][j - 1];
		rg.v270 = val[i + 1][j + 1];
		
	
		
		
		
		return rg;
	}

	private Region calculateSecondMax(int i, int j, int gridSize, int[][] val) {
		return null;

	}

	private boolean isBound(int i, int j, int gridSize) {

		if (i == 0 || j == 0 || i == gridSize - 1 || j == gridSize - 1) {
			return true;
		}

		return false;
	}

	private boolean isSecondBound(int i, int j, int gridSize) {

		if (i == 1 || j == 1 || i == gridSize - 2 || j == gridSize - 2) {
			return true;
		}

		return false;
	}

	public static enum RegionDirection {

		FOUR, 
		V45,
		V45_UP,
		V45_DOWN,
		V135,
		V135_UP,
		V135_DOWN,

	}

	public static class Region {
		public int left;
		public int right;
		public int up;
		public int down;
		public int center;

		public int v45E;
		public int v135E;
		public int v225E;
		public int v270E;

		public int v45;
		public int v135;
		public int v225;
		public int v270;

		public int max;
		public RegionDirection direction;
	}
}
